An Expressive Decentralizing KP-ABE Scheme with Constant-Size Ciphertext
نویسندگان
چکیده
Decentralizing attribute based encryption is a variant of multi-authority attribute based encryption which doesn’t require a trusted central authority to conduct the system setup. In this paper, we propose an expressive decentralizing KP-ABE scheme with constant ciphertext size. In our construction, the access policy can be expressed as any non-monotone access structure. Meanwhile, the ciphertext size is independent on the number of attributes used in the scheme. We prove that our scheme is semantic secure in so-called Selective-Set model based on the n-DBDHE assumption. To the best of our knowledge, this is the first multi-authority attribute based encryption scheme realizing such expressive access policy and constant ciphertext size.
منابع مشابه
Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
Attribute-based encryption (ABE), as introduced by Sahai and Waters, allows for fine-grained access control on encrypted data. In its key-policy flavor, the primitive enables senders to encrypt messages under a set of attributes and private keys are associated with access structures that specify which ciphertexts the key holder will be allowed to decrypt. In most ABE systems, the ciphertext siz...
متن کاملA Framework and Compact Constructions for Non-monotonic Attribute-Based Encryption
In this paper, we propose new non-monotonic attribute-based encryption schemes with compact parameters. The first three schemes are key-policy attribute-based encryption (KP-ABE) and the fourth scheme is ciphertext-policy attribute-based encryption (CP-ABE) scheme. • Our first scheme has very compact ciphertexts. The ciphertext overhead only consists of two group elements and this is the shorte...
متن کاملExpressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
We propose a key-policy attribute-based encryption (KP-ABE) scheme with constantsize ciphertexts, whose semi-adaptive security is proven under the decisional linear (DLIN) assumption in the standard model. The access structure is expressive, that is given by non-monotone span programs. It also has fast decryption, i.e., a decryption includes only a constant number of pairing operations. As an a...
متن کاملConversions among Several Classes of Predicate Encryption and Their Applications
Predicate encryption is an advanced form of public-key encryption that yield high flexibility in terms of access control. In the literature, many predicate encryption schemes have been proposed such as fuzzy-IBE, KP-ABE, CPABE, (doubly) spatial encryption (DSE), and ABE for arithmetic span programs. In this paper, we study relations among them and show that some of them are in fact equivalent b...
متن کاملConversions Among Several Classes of Predicate Encryption and Applications to ABE with Various Compactness Tradeoffs
Predicate encryption is an advanced form of public-key encryption that yield high flexibility in terms of access control. In the literature, many predicate encryption schemes have been proposed such as fuzzy-IBE, KP-ABE, CP-ABE, (doubly) spatial encryption (DSE), and ABE for arithmetic span programs. In this paper, we study relations among them and show that some of them are in fact equivalent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Network Security
دوره 15 شماره
صفحات -
تاریخ انتشار 2013